strong completeness

strong completeness
French\ \ complétude forte
German\ \ strenge Vollständigkeit
Dutch\ \ sterke volledigheid
Italian\ \ completezza forte
Spanish\ \ exhaustividad fuerte
Catalan\ \ completesa forta
Portuguese\ \ completude forte
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ stark fullständighet
Greek\ \ έντονη πληρότητα
Finnish\ \ vahva täydellisyys
Hungarian\ \ tartós teljesség
Turkish\ \ kuvvetli (sağlam) tamlık
Estonian\ \ tugev täielikkus
Lithuanian\ \ griežtasis pilnumas; griežtasis išsamumas
Slovenian\ \ -
Polish\ \ kompletność silna
Russian\ \ сильная полнота
Ukrainian\ \ сильна повнота
Serbian\ \ -
Icelandic\ \ sterk tæmandi
Euskara\ \ -
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ شديد الكمالية
Afrikaans\ \ sterk volledigheid
Chinese\ \ 强 完 备 性
Korean\ \ 강완비성

Statistical terms. 2014.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… …   Wikipedia

  • Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 …   Wikipedia

  • Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… …   Wikipedia

  • Functional completeness — In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.[1][2] A well known complete set of… …   Wikipedia

  • Monoidal t-norm logic — Monoidal t norm based logic (or shortly MTL), the logic of left continuous t norms, is one of t norm fuzzy logics. It belongs to the broader class of substructural logics, or logics of residuated lattices;[1] it extends the logic of commutative… …   Wikipedia

  • logic, history of — Introduction       the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic       There was a medieval tradition according to which the Greek philosopher …   Universalium

  • Infinitary logic — Those unfamiliar with mathematical logic or the concept of ordinals are advised to consult those articles first. An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have… …   Wikipedia

  • Truth-value semantics — In formal semantics, truth value semantics is an alternative to Tarskian semantics. It has been primarily championed by Ruth Barcan Marcus, H. Leblanc, and M. Dunn and N. Belnap. It is also called the substitution interpretation (of the… …   Wikipedia

  • Profinite group — In mathematics, profinite groups are topological groups that are in a certain sense assembled from finite groups; they share many properties with their finite quotients. Definition Formally, a profinite group is a Hausdorff, compact, and totally… …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

  • Consistency — For other uses, see Consistency (disambiguation). In logic, a consistent theory is one that does not contain a contradiction.[1] The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”